Optimizing Data Plane Resources for Multipath Flows
نویسندگان
چکیده
منابع مشابه
Mitigating Link Failures & Implementing Security Mechanism in Multipath Flows for Data Plane Resources
Ramya M PG Scholar, Department of Computer Science, Klasalingam Institute of Technology,Krishnan koil Email: [email protected] Kowsalya K PG Scholar, Department of Computer Science, Klasalingam Institute of Technology,Krishnan koil Email: [email protected] Ramesh V Assistant Professor, Department of Computer Science, Klasalingam Institute of Technology, Krishnan koil Email: prof.ramesh...
متن کاملOptimizing lattice Boltzmann simulations for unsteady flows
We present detailed analysis of a lattice Boltzmann approach to model time-dependent Newtonian flows. The aim of this study is to find optimized simulation parameters for a desired accuracy with minimal computational time. Simulation parameters for fixed Reynolds and Womersley numbers are studied. We investigate influences from the Mach number and different boundary conditions on the accuracy a...
متن کاملAnisotropic Flows for Convex Plane Curves
where V and k are, respectively, the normal velocity and curvature of the interface. Equation (1) is sometimes called the “curve shortening problem” because it is the negative L2-gradient flow of the length of the interface. By drawing pictures, one can be easily convinced that a simple closed curve stays simple and smooth along (1) and shrinks to a point in finite time, with the limiting shape...
متن کاملCriteria of selecting satellite data for studying land resources
In recent years, acquiring information of remote sensing data, especially satellite data has excessively increased and several methods are presented in order to improve the quality of remote sensing studies in earth sciences. It is possible to manage many projects and provide different types of thematic maps in a short period of time, and a low cost by utilizing satellite data and GIS method. R...
متن کاملCongestion Minimization for Multipath Routing via Multiroute Flows
Congestion minimization is a well-known routing problem for which there is an O(logn/ log logn)approximation via randomized rounding [17]. Srinivasan [18] formally introduced the low-congestion multi-path routing problem as a generalization of the (single-path) congestion minimization problem. The goal is to route multiple disjoint paths for each pair, for the sake of fault tolerance. Srinivasa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2015
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2013.2292895